The Traveling Tournament Problem (TTP) is a benchmark problem in sportsscheduling and has been extensively studied in recent years. The MirroredTraveling Tournament Problem (mTTP) is variation of the TTP that representscertain types of sports scheduling problems where the main objective is tominimize the total distance traveled by all the participating teams. In thispaper we test a parallel simulated annealing approach for solving the mTTPusing OpenMP on shared memory systems and we found that this approach issuperior especially with respect to the number of solution instances that areprobed per second. We also see that there is significant speed up of 1.5x -2.2x in terms of number of solutions explored per unit time.
展开▼
